The Fermat star of binary treesLUCCIO, Fabrizio; PAGLI, Linda.Information processing letters. 2009, Vol 109, Num 11, pp 568-571, issn 0020-0190, 4 p.Article

k-Restricted rotation distance between binary treesLUCCIO, Fabrizio; ENRIQUEZ, Antonio Mesa; PAGLI, Linda et al.Information processing letters. 2007, Vol 102, Num 5, pp 175-180, issn 0020-0190, 6 p.Article

Local majorities, coalitions and monopolies in graphs: a reviewPELEG, David.Theoretical computer science. 2002, Vol 282, Num 2, pp 231-257, issn 0304-3975Conference Paper

Lower bounds on the rotation distance of binary treesLUCCIO, Fabrizio; MESA ENRIQUEZ, Antonio; PAGLI, Linda et al.Information processing letters. 2010, Vol 110, Num 21, pp 934-938, issn 0020-0190, 5 p.Article

Refined upper bounds for right-arm rotation distancesCLEARY, Sean; LUCCIO, Fabrizio; PAGLI, Linda et al.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 277-281, issn 0304-3975, 5 p.Article

Fun with algorithms 2 (FUN 2001)LODI, Elena; PAGLI, Linda; SANTORO, Nicola et al.Discrete applied mathematics. 2004, Vol 144, Num 3, issn 0166-218X, 157 p.Conference Proceedings

Algorithms, nymphs, and shepherdsLUCCIO, F.Theoretical computer science. 2002, Vol 282, Num 2, pp 223-229, issn 0304-3975Conference Paper

FUN with algorithmsLODI, Elena; PAGLI, Linda; SANTORO, Nicola et al.Theoretical computer science. 2002, Vol 282, Num 2, issn 0304-3975, 178 p.Conference Proceedings

Playing by searching: two strategies against a linearly bounded liarPEDROTTI, Alberto.Theoretical computer science. 2002, Vol 282, Num 2, pp 285-302, issn 0304-3975Conference Paper

A note on line broadcast in digraphs under the edge-disjoint paths modeFRAIGNIAUD, Pierre.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 320-323, issn 0166-218X, 4 p.Conference Paper

A manifesto for the computational methodSEIDEN, Steve.Theoretical computer science. 2002, Vol 282, Num 2, pp 381-395, issn 0304-3975Conference Paper

Arrays, numeration systems and Frankenstein gamesFRAENKEL, Aviezri S.Theoretical computer science. 2002, Vol 282, Num 2, pp 271-284, issn 0304-3975Conference Paper

Tantrix rotation puzzles are intractableHOLZER, Markus; HOLZER, Waltraud.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 345-358, issn 0166-218X, 14 p.Conference Paper

The geometry of carpentry and joineryMORIN, Pat; MORRISON, Jason.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 374-380, issn 0166-218X, 7 p.Conference Paper

Coordination without communication: the case of the flocking problemGERVASI, Vincenzo; PRENCIPE, Giuseppe.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 324-344, issn 0166-218X, 21 p.Conference Paper

Fast three-level logic minimization based on autosymmetryBERNASCONI, Anna; CIRIANI, Valentina; LUCCIO, Fabrizio et al.Design automation conference. 2002, pp 425-430, isbn 1-58113-461-4, 6 p.Conference Paper

The chords' problemDAURAT, Alain; GERARD, Yan; NIVAT, Maurice et al.Theoretical computer science. 2002, Vol 282, Num 2, pp 319-336, issn 0304-3975Conference Paper

Patterns in words and languagesCASTIGLIONE, G; RESTIVO, A; SALEMI, S et al.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 237-246, issn 0166-218X, 10 p.Conference Paper

Text sparsification via local maximaCRESCENZI, Pilu; DEL LUNGO, Alberto; GROSSI, Roberto et al.Theoretical computer science. 2003, Vol 304, Num 1-3, pp 341-364, issn 0304-3975, 24 p.Article

Point-of-failure shortest-path rerouting : Computing the optimal swap edges distributively : Special section on parallel/distributed computing and networkingFLOCCHINI, Paola; ENRIQUES, Antonio Mesa; PAGLI, Linda et al.IEICE transactions on information and systems. 2006, Vol 89, Num 2, pp 700-708, issn 0916-8532, 9 p.Article

Waiting patterns for a printerMERLINI, D; SPRUGNOLI, R; VERRI, M. C et al.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 359-373, issn 0166-218X, 15 p.Conference Paper

A shifting algorithm for continuous tree partitioningBECKER, Ronald; SIMEONE, Bruno; CHIANG, Yen-I et al.Theoretical computer science. 2002, Vol 282, Num 2, pp 353-380, issn 0304-3975Conference Paper

Optimal covering designs: complexity results and new boundsCRESCENZI, Pilu; MONTECALVO, Federico; ROSSI, Gianluca et al.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 281-290, issn 0166-218X, 10 p.Conference Paper

Room allocation: a polynomial subcase of the quadratic assignment problemCIRIANI, Valentina; PISANTI, Nadia; BERNASCONI, Anna et al.Discrete applied mathematics. 2004, Vol 144, Num 3, pp 263-269, issn 0166-218X, 7 p.Conference Paper

Implicit B-trees: New results for the dictionary problemFRANCESCHINI, Gianni; GROSSI, Roberto; IAN MUNRO, J et al.Annual Symposium on Foundations of Computer Science. 2002, pp 145-154, isbn 0-7695-1822-2, 10 p.Conference Paper